Tableaux Modulo Theories Using Superdeduction

We propose a method that allows us to develop tableaux modulo theories using the principles of superdeduction, among which the theory is used to enrich the deduction system with new deduction rules. This method is presented in the framework of the Zenon automated theorem prover, and is applied to the set theory of the B method. This allows us to provide another prover to Atelier B, which can be used to verify B proof rules in particular. We also propose some benchmarks, in which this prover is able to automatically verify a part of the rules coming from the database maintained by Siemens IC-MOL. Finally, we describe another extension of Zenon with superdeduction, which is able to deal with any first order theory, and provide a benchmark coming from the TPTP library, which contains a large set of first order problems.Comment: arXiv admin note: substantial text overlap with arXiv:1501.0117

Imposed Switching Frequency Direct Torque Control of Induction Machine Using Five Level Flying Capacitors Inverter

The paper proposes a new control structure for sensorless induction motor drive based on a five-level voltage source inverter (VSI). The output voltages of the five-level VSI can be represented by nine groups. Then, the amplitude and the rotating velocity of the flux vector can be controlled freely. Both fast torque and optimal switching logic can be obtained. The selection is based on the value of the stator flux and the torque. This paper investigates a new control structure focused on controlling switching frequency and torque harmonics contents. These strategies, called ISFDTC, indeed combines harmoniously both these factors, without compromising the excellence of the dynamical performances typically conferred to standard DTC strategies. The validity of the proposed control technique is verified by Matlab/Simulink. Simulation results presented in this paper confirm the validity and feasibility of the proposed control approach and can be tested on experimental setup.Peer reviewe

Automatisation des preuves pour la vérification des règles de l'Atelier B

Cette thèse porte sur la vérification des règles ajoutées de l'Atelier B en utilisant une plate-forme appelée BCARe qui repose sur un plongement de la théorie sous-jacente à la méthode B (théorie de B) dans l'assistant à la preuve Coq. En particulier, nous proposons trois approches pour prouver la validité d'une règle, ce qui revient à prouver une formule exprimée dans la théorie de B. Ces trois approches ont été évaluées sur les règles de la base de règles de SIEMENS IC-MOL. La première approche dite autarcique est développée avec le langage de tactiques de Coq Ltac. Elle repose sur une première étape qui consiste à déplier tous les opérateurs ensemblistes pour obtenir une formule de la logique du premier ordre. Puis nous appliquons une procédure de décision qui met en oeuvre une heuristique naïve en ce qui concerne les instanciations. La deuxième approche, dite sceptique,appelle le prouveur automatique de théorèmes Zenon après avoir effectué l'étape de normalisation précédente. Nous vérifions ensuite les preuves trouvées par Zenon dans le plongement profond de B en Coq. La troisième approche évite l'étape de normalisation précédente grâce à une extension de Zenon utilisant des règles d'inférence spécifiques à la théorie de B. Ces règles sont obtenues grâce à la technique de superdéduction. Cette dernière approche est généralisée en une extension de Zenon à toute théorie grâce à un calcul dynamique des règles de superdéduction. Ce nouvel outil, appelé Super Zenon, peut par exemple prouver des problèmes issus de la bibliothèque de problèmes TPTP.The purpose of this thesis is the verification of Atelier B added rules using the framework named BCARe which relies on a deep embedding of the B theory within the logic of the Coq proof assistant. We propose especially three approaches in order to prove the validity of a rule, which amounts to prove a formula expressed in the B theory. These three approaches have been assessed on the rules coming from the rule database maintained by Siemens IC-MOL. To do so, the first approach, so-called autarkic approach, is developed thanks to the Coq tactic language, Ltac. It rests upon a first step which consists in unfolding the set operators so as to obtain a first order formula. A decision procedure which implements an heuristic is applied afterwards to deal with instantiation. We propose a second approach, so-called skeptic approach, which uses the automated first order theorem prover Zenon, after the previous normalization step has been applied. Then we verify the Zenon proofs in the deep embedding of B in Coq. A third approach consists in using anextension of Zenon to the B method thanks to the superdeduction. Superdeduction allows us to add the axioms of the B theory by means of deduction rules in the proof mechanism of Zenon. This last approach is generalized in an extension of Zenon to every theory thanks to a dynamic calculus of the superdeduction rules. This new tool, named Super Zenon, is able to prove problems coming from the problem library TPTP, for example.PARIS-CNAM (751032301) / SudocSudocFranceF

Tableaux Modulo Theories Using Superdeduction

International audienceWe propose a method that allows us to develop tableaux modulo theories using the principles of superdeduction, among which the theory is used to enrich the deduction system with new deduction rules. This method is presented in the framework of the Zenon automated theorem prover, and is applied to the set theory of the B method. This allows us to provide another prover to Atelier B, which can be used to verify B proof rules in particular. We also propose some benchmarks, in which this prover is able to automatically verify a part of the rules coming from the database maintained by Siemens IC-MOL. Finally, we describe another extension of Zenon with superdeduction, which is able to deal with any first order theory, and provide a benchmark coming from the TPTP library, which contains a large set of first order problems

Un cadre méthodologique pour l'intégration de services par évitement des interactions

Les opérateurs téléphoniques offrent des services dans l'objectif d'autoriser un client à composer son propre bouquet de services. Les attentes exprimées pour chacun des services pris séparément peuvent faire émerger des conflits, nommées interactions. Nous proposons une méthode d'intégration de services à destination d'un expert qui tient compte des interactions détectées. Elle débute par une phase de conception comprenant une assistance outillée suivie par une phase de validation utilisant des techniques de test. La phase de conception est instantiée à l'aide d'un formalisme de type pre-post condition. Des propriétés exprimant des interactions potentielles comme le non-déterminisme ou la violation d'invariants sont à l'origine des heuristiques introduites pour la détection d'interactions. Des scénari d'intégration permettant de guider un expert sont en partie prototypés dans un outil et des études de cas ont été réalisées afin d'illustrer la méthodologie proposée.Telephone operators supply features in order to enable customers to compose their own packages of features. The requirements of these features are expressed separately. However, put altogether, these requirements can yied conflicts, the so-called interaction. To solve this issue, we propose a feature integration method to be used by anexpert. This method takes into account the detected feature interactions. This method is made up of a design step with tool support which precedes a validation step based on testin techniques. An instance of the design step is defined by means of a pre-post condition formalism. Properties that express potential interactions as non-determinism or invariant violation are at the origin of heuristics introduced for the interactions detection. Integration patterns that guide the expert are partly programmed in our tool and several case studies have been used to illustrate our method.EVRY-BU (912282101) / SudocSudocFranceF

BCARe : Contrôle automatique des règles ajoutées à SIEMENS

Ce chapitre présente l'outil de Siemens appelé BCARe, dédié à la vérification automatique des règles ajoutées de l'Atelier B

Tableaux Modulo Theories using Superdeduction: An Application to the Verification of B Proof Rules with the Zenon Automated Theorem Prover

We propose a method which allows us to develop tableaux modulo theories using the principles of superdeduction, among which the theory is used to enrich the deduction system with new deduction rules. This method is presented in the framework of the Zenon automated theorem prover, and is applied to the set theory of the B method. This allows us to provide another prover to Atelier B, which can be used to verify B proof rules in particular. We also propose some benchmarks, in which this prover is able to automatically verify a part of the rules coming from the database maintained by Siemens IC-MOL

SCOLA: a Scenario Oriented LAnguage for railway system specifications Context Formal model System specifications

International audience

Verifying B Proof Rules using Deep Embedding and Automated Theorem Proving

International audienceWe propose a formal and mechanized framework which consists in verifying proof rules of the B method, which cannot be automatically proved by the elementary prover of Atelier B and using an external automated theorem prover called Zenon. This framework contains in particular a set of tools, named BCARe and developed by Siemens SAS I MO, which relies on a deep embedding of the B theory within the logic of the Coq proof assistant and allows us to automatically generate the required properties to be checked for a given proof rule. Currently, this tool chain is able to automatically verify a part of the derived rules of the B-Book, as well as some added rules coming from Atelier B and the rule database maintained by Siemens SAS I MO